Bounds for Hilbert's Irreducibility Theorem
نویسندگان
چکیده
منابع مشابه
On Hilbert’s Irreducibility Theorem
In this paper we obtain new quantitative forms of Hilbert’s Irreducibility Theorem. In particular, we show that if f(X,T1, . . . , Ts) is an irreducible polynomial with integer coefficients, having Galois group G over the function field Q(T1, . . . , Ts), and K is any subgroup of G, then there are at most Of,ε(H s−1+|G/K|+ε) specialisations t ∈ Zs with |t| ≤ H such that the resulting polynomial...
متن کاملFiniteness Results for Hilbert’s Irreducibility Theorem
Let k be a number field, Ok its ring of integers, and f(t,X) ∈ k(t)[X] be an irreducible polynomial. Hilbert’s irreducibility theorem gives infinitely many integral specializations t 7→ t̄ ∈ Ok such that f(t̄, X) is still irreducible. In this paper we study the set Redf (Ok) of those t̄ ∈ Ok with f(t̄, X) reducible. We show that Redf (Ok) is a finite set under rather weak assumptions. In particular...
متن کاملHilbert’s Irreducibility Theorem and the Larger Sieve
We describe an explicit version of Hilbert’s irreducibility theorem using a generalization of Gallagher’s larger sieve. We give applications to the Galois theory of random polynomials, and to the images of the adelic representation associated to elliptic curves varying in rational families.
متن کاملU. Zannier ON THE HILBERT IRREDUCIBILITY THEOREM
We discuss the Hilbert Irreducibility Theorem, presenting briefly a new approach which leads to novel conclusions, especially in the context of algebraic groups. After a short survey of the issues and of the known theory, we shall illustrate the main principles and mention some new results; in particular, we shall state a toric analogue of Bertini’s Theorem and a lifting theorem for rational po...
متن کاملBounds for Hodes-Specker theorem
In [2] Hodes and Specker proved a theorem which implies that certain Boolean functions have nonlinear formula size complexity. I shall prove that the asymptotic bound for the theorem is n. log log n. § O. Introduction Let f be a Boolean function, i.e. f:[0,1} n-~ {0, I} for some positive integer n. The variables of f will be denoted usually by Xl, . . . . . . . ,x n. Given 1 L il<i2< <irOn, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pure and Applied Mathematics Quarterly
سال: 2008
ISSN: 1558-8599,1558-8602
DOI: 10.4310/pamq.2008.v4.n4.a4